Computing preferred answer sets by meta-interpretation in Answer Set Programming
نویسندگان
چکیده
منابع مشابه
Computing Preferred and Weakly Preferred Answer Sets by Meta Interpretation in Answer Set Programming
Preferred and Weakly Preferred Answer Sets are extensions to Answer Set Programming (ASP) which allow the user to specify priorities for rules. In this paper we present a first implementation of these formalisms by means of “metainterpreters” on top of DLV, an efficient engine for Disjunctive ASP. This approach shows the suitability of ASP in general and of DLV in particular for fast prototypin...
متن کاملComputing preferred answer sets by meta-interpretation in answer set programming
Most recently, Answer Set Programming (ASP) is attracting interest as a new paradigm for problem solving. An important aspect which needs to be supported is the handling of preferences between rules, for which several approaches have been presented. In this paper, we consider the problem of implementing preference handling approaches by means of meta-interpreters in Answer Set Programming. In p...
متن کاملMeta-interpretation in Answer Set Programming
Most recently, Answer Set Programming (ASP) is attracting interest as a new paradigm for problem solving. An important aspect which needs to be supported is the handling of preferences between rules, for which several approaches have been presented. In this paper, we consider the problem of implementing preference handling approaches by means of meta-interpreters in Answer Set Programming. In p...
متن کاملComputing Secure Sets in Graphs using Answer Set Programming
Problems from the area of graph theory always served as fruitful benchmarks in order to explore the performance of Answer Set Programming (ASP) systems. A relatively new branch in graph theory is concerned with so-called secure sets. It is known that verifying whether a set is secure in a graph is already co-NP-hard. The problem of enumerating all secure sets thus is challenging for ASP and its...
متن کاملAnswer Sets and the Language of Answer Set Programming
Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory article provides the mathematical background for the discussion of answer set programming in other contributions to this special issue.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2003
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068403001753